package com.lsa.letcode.the136.singleNumber;

public class Solution {
    public int singleNumber(int[] nums) {
    	int res = nums[0];
    	for (int i = 1; i < nums.length; i++) {
			res = res ^ nums[i];
		}
        return res;
    }
}